On the Implementation of Mixed Methods as Nonconforming Methods for Second-order Elliptic Problems
نویسندگان
چکیده
In this paper we show that mixed finite element methods for a fairly general second-order elliptic problem with variable coefficients can be given a nonmixed formulation. (Lower-order terms are treated, so our results apply also to parabolic equations.) We define an approximation method by incorporating some projection operators within a standard Galerkin method, which we call a projection finite element method. It is shown that for a given mixed method, if the projection method's finite element space Mh satisfies three conditions, then the two approximation methods are equivalent. These three conditions can be simplified for a single element in the case of mixed spaces possessing the usual vector projection operator. We then construct appropriate nonconforming spaces Mh for the known triangular and rectangular elements. The lowest-order Raviart-Thomas mixed solution on rectangular finite elements in R2 and R3, on simplices, or on prisms, is then implemented as a nonconforming method modified in a simple and computationally trivial manner. This new nonconforming solution is actually equivalent to a postprocessed version of the mixed solution. A rearrangement of the computation of the mixed method solution through this equivalence allows us to design simple and optimal-order multigrid methods for the solution of the linear system.
منابع مشابه
Recent Development of Multigrid Algorithms for Mixed and Nonconforming Methods for Second Order Elliptic Problems
Multigrid algorithms for nonconforming and mixed nite element methods for second order elliptic problems on triangular and rectangular nite elements are considered. The construction of several coarse-tone intergrid transfer operators for nonconforming multigrid algorithms is discussed. The equivalence between the nonconforming and mixed nite element methods with and without projection of the co...
متن کاملNonconforming Mixed Discretization of Second Order Elliptic Problems
In the realm of nite element discretizations of elliptic problems a basic distinction can be made between conforming and nonconforming methods. The latter rely on approximations not contained in the space the exact solution lives in. Since additional diiculties are thus introduced nonconforming approaches usually are a last resort: if satisfactory conforming spaces prove elusive they are given ...
متن کاملThe Analysis of Multigrid Algorithms for Nonconforming and Mixed Methods for Second Order Elliptic Problems
In this paper we consider multigrid algorithms for nonconforming and mixed nite element methods for second order elliptic problems on triangular and rectangular nite elements. We prove optimal convergence properties of the W-cycle multigrid algorithm and uniform condition number estimates for the variable V-cycle preconditioner. Lower order terms are treated, so our results also apply to parabo...
متن کاملOn the Implementation of Mixed Methodsas Nonconforming Methodsfor Second Order Elliptic
In this paper we show that mixed nite element methods for a fairly general second order elliptic problem with variable coeecients can be given a non-mixed formulation. (Lower order terms are treated, so our results apply also to parabolic equations.) We deene an approximation method by incorporating some projection operators within a standard Galerkin method, which we call a projection nite ele...
متن کاملEquivalence between and Multigrid Algorithms for Mixed and Nonconforming Methods for Second Order Elliptic Problems
The purpose of this paper is to establish an equivalence between mixed and nonconforming nite element methods for second order elliptic problems on both triangular and rectangular nite elements in IR 2 and IR 3 , and to provide an analysis of multigrid methods for both methods based on the equivalence. We rst show that the linear system arising from the mixed method can be algebraically condens...
متن کامل